Research on Vehicle Routing Problem with Soft Time Windows Based on Hybrid Tabu Search and Scatter Search Algorithm
نویسندگان
چکیده
منابع مشابه
An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملOn Open Vehicle Routing Problem with Soft Time Windows and Tabu Search
As a typical NP-hard problem, open vehicle routing problem with soft time windows (OVRPSTW) is a kind of basic open vehicle routing problem with time windows. By setting fit neighbourhood structure, evaluation solutions, tabu list, and stopping criterion, author constructed a tabu search (TS) to solve the OVRPSTW. TS shows its good computational performance by testing benchmark problems.
متن کاملParallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows
In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows (CVRPsTW). The Tabu Search algorithms are of two kinds: Two of them are parallel with respect to functional decomposition and one approach is a collaborative multisearch TS. The implementation builds upon a framework called Di...
متن کاملSimulated Annealing and Tabu Search based Hybrid Algorithm for Multi Depot Vehicle Routing Problem with Time Windows and Split Delivery
Effective co-ordination of distribution operations of a manufacturing organization is paramount since it represents the major cost component of the logistic supply chain. In order to deal with high demand of orders with shorter lead time, distributed warehouse concept is introduced and this is currently being practiced. Furthermore, due to inherent deficiencies in VRP, rules have been extended ...
متن کاملA Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
This paper describes a tabu search heuristic for the vehicle routing problem with soft time windows. This problem allows lateness at customer locations although a penalty is then incurred and added to the objective value. By adding large penalty values, the vehicle routing problem with hard time windows can be addressed as well. In the tabu search, a neighborhood of the current solution is crea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers, Materials & Continua
سال: 2020
ISSN: 1546-2226
DOI: 10.32604/cmc.2020.010977